package leetcode;

import java.util.ArrayList;
import java.util.List;
import java.util.Objects;

public class T94 {


    public List<Integer> inorderTraversal(TreeNode root) {
        List<Integer> result = new ArrayList<>();


        if(Objects.isNull(root)){
            return result;
        }
        inorderTraversal(root.left);
        result.add(root.val);
        inorderTraversal(root.right);
        return result;
    }


}
